Cellular automata computations and secret key cryptography
نویسندگان
چکیده
Franciszek Seredynski *, Pascal Bouvry , Albert Y. Zomaya d a Polish–Japanese Institute of Information Technologies, Koszykowa 86, 02-008 Warsaw, Poland b Institute of Computer Science of Polish Academy of Sciences, Ordona 21, 01-237 Warsaw, Poland c Faculty of Sciences, Technology and Communication, Luxembourg University 6, rue Coudenhove Kalergi, L-1359 Luxembourg-Kirchberg, Luxembourg d School of Information Technologies, University of Sydney, Sydney, NSW 2006 Australia
منابع مشابه
A Fast Cryptosystem Using Reversible Cellular Automata
This article defines a new algorithm for a secret key cryptosystem using cellular automata which is a promising approach to cryptography. Our algorithm is based on cellular automata built on a set of reversible rules which have the ability to construct unpredictable secret keys using MARGOLUS neighborhood. To prove the feasibility of the algorithm, we present some tests of encryption, decryptio...
متن کاملSecret Key Cryptography with Cellular Automata
The paper presents new results concerning application of cellular automata (CAs) to the secret key cryptography extending results presented in (14, 1.51. One dimensional, nonunifOrm CAs is considered us a generator ofpseudorundam number sequences (PNS) used in cryptography with the secret key. The quality of PNSs highly depends on a set of applied CA rules. Tojnd such rules nonunifOrm CAs with ...
متن کاملCryptosystems Based on Reversible Cellular Automata
We propose the use of reversible cellular automata (RCA) as eecient encryp-tion and decryption devices. The eeciency is due to their inherent parallelism. They can be used both as classical secret-key cryptosystems and as public-key systems.
متن کاملA New Iterative Secret Key Cryptosystem Based on Reversible and Irreversible Cellular Automata
Many cryptosystems have been released to secure electronic data on internet. Some data are very critical to be transmitted as plaintext. Thus, to ensure the data confidentiality and integrity, a list of cryptosystems have been elaborated. The most important ones are divided into two categories: symmetric algorithms encrypting and decrypting data in blocks using a single secret key; and asymmetr...
متن کاملGenerating PNS for Secret Key Cryptography Using Cellular Automaton
The paper presents new results concerning application of cellular automata (CAs) to the secret key using vernam cipher cryptography.CA are applied to generate pseudo-random numbers sequence (PNS) which is used during the encryption process. One dimensional, non-uniform CAs is considered as a generator of pseudorandom number sequences (PNSs) used in cryptography with the secret key. The quality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 30 شماره
صفحات -
تاریخ انتشار 2004